Byzantine gathering in networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Byzantine Gathering in Networks with Authenticated Whiteboards

We propose an algorithm for the gathering problem of mobile agents in Byzantine environments. Our algorithm can make all correct agents meet at a single node in O(fm) time (f is the upper bound of the number of Byzantine agents and m is the number of edges) under the assumption that agents have unique ID and behave synchronously, each node is equipped with an authenticated whiteboard, and f is ...

متن کامل

Byzantine Gathering in Polynomial Time

Gathering a group of mobile agents is a fundamental task in the field of distributed and mobile systems. This can be made drastically more difficult to achieve when some agents are subject to faults, especially the Byzantine ones that are known as being the worst faults to handle. In this paper we study, from a deterministic point of view, the task of Byzantine gathering in a network modeled as...

متن کامل

Byzantine Agreement in Sensor Networks

This paper is the outcome of a study for three algorithms that can be used to solve the Byzantine Generals/Agreement problem in sensor networks. Sensor networks are in this way different from the regular networks, where solutions have been proposed for, that they use broadcasting to communicate with other nodes. This paper presents one algorithm for reaching Byzantine Agreement in fully connect...

متن کامل

Information Gathering in Bayesian Networks

The optimal design of data acquisition is not obvious in Bayesian Network models. The dependency structure may vary dramatically, which makes learning and information evaluation complicated and sometimes non-intuitive. Our application, and the motivation for working on this topic, is prospect selection for petroleum exploration in the North Sea. Here, the data gathering is often carried out dur...

متن کامل

Attack-Aware Cooperative Spectrum Sensing in Cognitive Radio Networks under Byzantine Attack

Cooperative Spectrum Sensing (CSS) is an effective approach to overcome the impact of multi-path fading and shadowing issues. The reliability of CSS can be severely degraded under Byzantine attack, which may be caused by either malfunctioning sensing terminals or malicious nodes. Almost, the previous studies have not analyzed and considered the attack in their models. The present study introduc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Distributed Computing

سال: 2016

ISSN: 0178-2770,1432-0452

DOI: 10.1007/s00446-016-0276-9